Some Complexity Results about Essential Closed Sets
نویسنده
چکیده
We examine the enumeration problem for essential closed sets of a formal context. Essential closed sets are sets that can be written as the closure of a pseudo-intent. The results for enumeration of essential closed sets are similar to existing results for pseudo-intents, albeit some differences exist. For example, while it is possible to compute the lectically first pseudo-intent in polynomial time, we show that it is not possible to compute the lectically first essential closed set in polynomial time unless P = NP. This also proves that essential closed sets cannot be enumerated in the lectic order with polynomial delay unless P = NP. We also look at minimal essential closed sets and show that they cannot be enumerated in output polynomial time unless P = NP.
منابع مشابه
Some Generalizations of Locally Closed Sets
Arenas et al. [1] introduced the notion of lambda-closed sets as a generalization of locally closed sets. In this paper, we introduce the notions of lambda-locally closed sets, Lambda_lambda-closed sets and lambda_g-closed sets and obtain some decompositions of closed sets and continuity in topological spaces.
متن کاملSome new properties of fuzzy strongly ${{g}^{*}}$-closed sets and $delta {{g}^{*}}$-closed sets in fuzzy topological spaces
In this paper, a new class of fuzzy sets called fuzzy strongly ${{g}^{*}}$-closed sets is introduced and its properties are investigated. Moreover, we study some more properties of this type of closed spaces.
متن کاملSoft regular generalized b-closed sets in soft topological spaces
The main purpose of this paper is to introduce and study new classes of soft closed sets like soft regular generalized b-closed sets in soft topological spaces (briefly soft rgb-closed set) Moreover, soft rg-closed, soft gpr-closed, soft gb-closed, soft gsp-closed, soft g$alpha$-closed, soft g$alpha$b-closed, and soft sgb-closed sets in soft topological spaces are introduced in this paper and w...
متن کاملSome results on functionally convex sets in real Banach spaces
We use of two notions functionally convex (briefly, F--convex) and functionally closed (briefly, F--closed) in functional analysis and obtain more results. We show that if $lbrace A_{alpha} rbrace _{alpha in I}$ is a family $F$--convex subsets with non empty intersection of a Banach space $X$, then $bigcup_{alphain I}A_{alpha}$ is F--convex. Moreover, we introduce new definition o...
متن کاملOn the Complexity of Computing Generators of Closed Sets
We investigate the computational complexity of some decision and counting problems related to generators of closed sets fundamental in Formal Concept Analysis. We recall results from the literature about the problem of checking the existence of a generator with a specified cardinality, and about the problem of determining the number of minimal generators. Moreover, we show that the problem of c...
متن کامل